$L$-Primitive Words in Submonoids
نویسندگان
چکیده
This work considers a natural generalization of primitivity with respect to a language. Given a language L, a nonempty word w is said to be L-primitive if w is not a proper power of any word in L. After ascertaining the number of primitive words in submonoids of a free monoid, the work proceeds to count L-primitive words in submonoids of a free monoid. The work also studies the distribution of L-primitive words in certain subsets of free monoids.
منابع مشابه
Primitive representations of the polycyclic monoids and branching function systems
We generalise the group theoretic notion of a primitive permutation representation to inverse monoids and so obtain a notion of a primitive representation by partial permutations. Such representations are shown to be determined by what we call essentially maximal proper closed inverse submonoids. Such submonoids in the case of the polycyclic inverse monoids (also known as Cuntz inverse semigrou...
متن کاملConnecting Fuzzy submonoids, fuzzy preorders and quasi-metrics
This paper is an extended abstract of my paper [12] published in Fuzzy Set and Systems. We start from a residuated lattice L and a monoid M , and we define a Galois connection from the lattice of the compatible L-preorders in M and the lattice of L-submonoids of M . Given a set S we define a Galois connection between the lattice of the L-preorders in S and the lattice of L-submonoids of the mon...
متن کاملAn automata-theoretic approach to the study of the intersection of two submonoids of a free monoid
We investigate the intersection of two finitely generated submonoids of the free monoid on a finite alphabet A. To this purpose, we consider automata that recognize such submonoids and we study the product automata recognizing their intersection. By using automata methods we obtain a new proof of a result of Karhumäki on the characterization of the intersection of two submonoids of rank two, in...
متن کاملPrimitive partial permutation representations of the polycyclic monoids and branching function systems
We characterise the maximal proper closed inverse submonoids of the polycyclic inverse monoids, also known as Cuntz inverse semigroups, and so determine all their primitive partial permutation representations. We relate our results to the work of Kawamura on certain kinds of representations of the Cuntz C∗-algebras and to the branching function systems of Bratteli and Jorgensen.
متن کاملA Sufficient Condition for Hanna Neumann Property of Submonoids of a Free Monoid
Using automata-theoretic approach, Giambruno and Restivo have investigated on the intersection of two finitely generated submonoids of the free monoid over a finite alphabet. In particular, they have obtained Hanna Neumann property for a special class of submonoids generated by finite prefix sets. This work continues their work and provides a sufficient condition for Hanna Neumann property for ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1403.5788 شماره
صفحات -
تاریخ انتشار 2014